| |
|
|
|
Registro Completo |
|
Biblioteca(s): |
Embrapa Agricultura Digital. |
|
Data corrente: |
30/09/1996 |
|
Data da última atualização: |
18/02/2011 |
|
Autoria: |
NASCIMENTO, M. A.; DUNHAN, M. H.; ELMASRI, R. |
|
Afiliação: |
MARIO A. NASCIMENTO, CNPTIA; MARGARET H. DUNHAM, Southern Methodist University; RAMEZ ELMASRI, University of Texas. |
|
Título: |
Analytical performance studies of the IVTT bitemporal access structure. |
|
Ano de publicação: |
1995 |
|
Fonte/Imprenta: |
Dallas: Southern Methodist University, 1995. |
|
Páginas: |
31 f. |
|
Série: |
(Technical Report, 95-CSE-19). |
|
Idioma: |
Inglês |
|
Conteúdo: |
Indexing temporal databases is a difficult problem because of their size and complexity. Thus far, the related literature presents no research on indexing bitemporal databases, only single-dimensional temporal indexing has been investigated. In this paper we present two indexing structures for bitemporal databases, which incorporate both valid time and transaction time. They are based on a tree structure that indexes transaction time, and points to a forest of trees that index valid time. The forest of valid time trees is kept in an incremental mode. This saves substantial space at the expense of search time when referring to past states of the database. Queries referring to the current state of the database suffer no loss. We present a performance analysis in terms of storage and I/O required to answer a general bitemporal query. |
|
Palavras-Chave: |
Bases de dados temporais; Indexação de base de dados. |
|
Thesaurus Nal: |
Databases. |
|
Categoria do assunto: |
X Pesquisa, Tecnologia e Engenharia |
|
Marc: |
LEADER 01402nam a2200193 a 4500
001 1003664
005 2011-02-18
008 1995 bl uuuu t 00u1 u #d
100 1 $aNASCIMENTO, M. A.
245 $aAnalytical performance studies of the IVTT bitemporal access structure.
260 $aDallas: Southern Methodist University$c1995
300 $a31 f.
490 $a(Technical Report, 95-CSE-19).
520 $aIndexing temporal databases is a difficult problem because of their size and complexity. Thus far, the related literature presents no research on indexing bitemporal databases, only single-dimensional temporal indexing has been investigated. In this paper we present two indexing structures for bitemporal databases, which incorporate both valid time and transaction time. They are based on a tree structure that indexes transaction time, and points to a forest of trees that index valid time. The forest of valid time trees is kept in an incremental mode. This saves substantial space at the expense of search time when referring to past states of the database. Queries referring to the current state of the database suffer no loss. We present a performance analysis in terms of storage and I/O required to answer a general bitemporal query.
650 $aDatabases
653 $aBases de dados temporais
653 $aIndexação de base de dados
700 1 $aDUNHAN, M. H.
700 1 $aELMASRI, R.
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
URL |
Voltar
|
|
|
| Registros recuperados : 55 | |
| Registros recuperados : 55 | |
|
| Nenhum registro encontrado para a expressão de busca informada. |
|
|
